Local Path Planning of Mobile Robot Using Critical-PointBug Algorithm Avoiding Static Obstacles
نویسندگان
چکیده
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملMobile robot path planning and stabilizing using static CCD camera
The paper presents investigations concerning an important problem of mobile robot control using visual feedback. Two main topics are considered: a collision-free path planning and posture tracking on the basis of pictures obtained from static monochromatic camera. A collision-free path is determined off-line in multiprocessor system using the artificial potential field method. Parallel algorith...
متن کاملMobile Robot Motion Planning Considering Path Ambiguity of Moving Obstacles
This paper describes a motion planning method for mobile robot which considers the path ambiguity of moving obstacles. Each moving obstacle has a set of paths and their probabilities. The robot selects the motion which minimizes the expected time to reach its destination, by recursively predicting future states of each obstacle and then selecting the best motion for them. To calculate the motio...
متن کاملNavigation of PIC based mobile robot using path planning algorithm
A robot is usually an electro-mechanical machine which is guided by computer or electronic programming. Conventional line tracer robots follow path in given map. In some kind of robots path is already store in its memory and it simply follows that path. When such types of robots are left to traverse through any random maze, these robots tend to traverse all possible paths every time having no f...
متن کاملPath Planning Algorithm for Mobile Robot
The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IAES International Journal of Robotics and Automation (IJRA)
سال: 2016
ISSN: 2089-4856,2089-4856
DOI: 10.11591/ijra.v5i3.pp182-189